#include <stdio.h>
void quicksort(int *a,int start,int end){
	int key=a[start],left=start,right=end;
	while(left<right){
		while(a[right]>=key&&left<right){
			right--;
		}
		a[left]=a[right];
		while(a[left]<=key&&left<right){
			left++;
		}
		a[right]=a[left];
	}
	a[left]=key;
	if(start<left-1) 
	quicksort(a,start,left-1);
	if(left+1<end)
	quicksort(a,left+1,end);
}
int main(){
	int n,a[10],i;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	quicksort(a,0,n-1);
	for(i=n-1;i>=0;i--){
		printf("%d",a[i]);
		if(i!=0){
			printf(" ");
		}
	}
	return 0;
} 
